Guaranteeing Pfair Supertasks by Reweighting
نویسندگان
چکیده
We consider the \supertask" approach, proposed by Moir and Ramamurthy at RTSS '99 as means for supporting non-migratory tasks in Pfair-scheduled systems. In this approach, tasks bound to the same processor are combined into a single supertask, which is scheduled as an ordinary Pfair task; when a supertask is scheduled, one of its component tasks is selected for execution. Unfortunately, while Moir and Ramamurthy's paper suggests that supertasking is a promising approach, counterexamples presented by them show that non-migratory tasks can actually miss their deadlines when supertasking is used in conjunction with all known Pfair scheduling algorithms. In this paper, we show that such deadline misses can be prevented by in ating each supertask's utilization. We present experimental evidence that shows that the required in ation factors should be small in practice. We also show that these in ation factors usually can be reduced if, instead of being scheduled in a Pfair manner, non-migratory tasks are scheduled (perhaps \unfairly") using earliest-deadlinerst priorities. In soft-real-time and rate-based systems, it may be permissible for a task to miss a deadline by a small amount. We show that our in ation factors also can be reduced if this is the case. Work supported by NSF grants CCR 9732916, CCR 9972211, CCR 9988327, and ITR 0082866. The rst author was also supported by an IBM fellowship.
منابع مشابه
Using Supertasks to Improve Processor Utilization in Multiprocessor Real-Time Systems
We revisit the problem of supertasking in Pfair-scheduled multiprocessor systems. In this approach, a set of tasks, called component tasks, is assigned to a server task, called a supertask , which is then scheduled as an ordinary Pfair task. Whenever a supertask is scheduled, its processor time is allocated to its component tasks according to an internal scheduling algorithm. Hence, supertaskin...
متن کاملSupporting Lock-free Synchronization in Pfair-scheduled Systems ?
We consider various techniques for implementing shared objects and for accounting for object-sharing overheads in Pfair-scheduled multiprocessor real-time systems. Lock-free objects are more economical than locking techniques when implementing relatively simple objects such as buffers, stacks, queues, and lists. In this paper, we explain how to bound the duration of lock-free object accesses un...
متن کاملObject Sharing in Pfair-scheduled Multiprocessor Systems
We consider various techniques for implementing shared objects and for accounting for objectsharing overheads in Pfair-scheduled multiprocessor systems. We primarily focus on the use of lock-free objects, though some lock-based alternatives are briefly considered as well. Lock-free objects are more economical for implementing relatively simple objects such as buffers, stacks, queues, and lists;...
متن کاملMixed Pfair/ERfair Scheduling of Asynchronous Periodic Tasks
There has been much recent interest in multiprocessor Pfair and ERfair scheduling algorithms. Under Pfair scheduling, each task is broken into quantum-length subtasks, each of which must execute within a \window" of time slots. These windows divide each period of a task into potentially overlapping subintervals of approximately equal length. \Early-release" fair (ERfair) scheduling was recently...
متن کاملWhat Is A Newtonian System? The Failure Of Energy Conservation And Determinism In Supertasks
Supertasks recently discussed in the literature purport to display a failure of energy conservation and determinism in Newtonian mechanics. We debate whether these supertasks are admissible as Newtonian systems, with Earman and Norton defending the affirmative and Alper and Bridger the negative.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001